Numerical Computation of Minimal Polynomial Bases: A Generalized Resultant Approach
نویسندگان
چکیده
We propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s): The proposed method exploits the structure of the left null space of generalized Wolovich or Sylvester resultants to compute row polynomial vectors that form a minimal polynomial basis of left kernel of the given polynomial matrix. The entire procedure can be implemented using only orthogonal transformations of constant matrices and results to a minimal basis with orthonormal coe¢ cients. Keywords: polynomial matrices; Minimal polynomial basis; Matrix fraction description. AMS classi cation: 15A33, 15A23, 65F30
منابع مشابه
On the Computation of Minimal Polynomial Bases
The problem of determination of a minimal polynomial basis of a rational vector space is the starting point of many control analysis, synthesis and design techniques. In this paper, we propose a new algorithm for the computation of a minimal polynomial basis of the left kernel of a given polynomial matrix F (s). The proposed method exploits the structure of the left null space of generalized W...
متن کاملA robust solution of the generalized polynomial Bezout identity
In this paper, algorithms for the computation of all matrices of the generalized polynomial Bezout identity are proposed. The algorithms are based on the computation of minimal polynomial basis for the right null spaces of certain polynomial matrices. For this reason, an algorithm for the computation of minimal polynomial bases is also proposed. Since this algorithm relies solely on singular va...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملAccurate solution of polynomial equations using Macaulay resultant matrices
We propose an algorithm for solving two polynomial equations in two variables. Our algorithm is based on the Macaulay resultant approach, combined with new techniques including randomization to make the algorithm accurate in the presence of roundoff error. The ultimate computation is the solution of a generalized eigenvalue problem via the QZ method. We analyze the error due to roundoff of the ...
متن کاملDetermination of a Matrix Function in the Form of f(A)=g(q(A)) Where g(x) Is a Transcendental Function and q(x) Is a Polynomial Function of Large Degree Using the Minimal Polynomial
Matrix functions are used in many areas of linear algebra and arise in numerical applications in science and engineering. In this paper, we introduce an effective approach for determining matrix function f(A)=g(q(A)) of a square matrix A, where q is a polynomial function from a degree of m and also function g can be a transcendental function. Computing a matrix function f(A) will be time- consu...
متن کامل